Program transformation landscapes for automated program modification using Gin

نویسندگان

چکیده

Abstract Automated program modification underlies two successful research areas — genetic improvement and repair. Under the generate-and-validate strategy, automated transforms a program, then validates result against test suite. Much work has focused on search space of application single fine-grained operators copy , delete replace swap at both line statement granularity. This explores limits this strategy. We scale up existing findings an order magnitude from small corpora to 10 real-world Java programs comprising 500k LoC. decisively show that grammar-specificity granular edits pays off: its pass rate triples uses 10% less computational resources. confirm previous is most effective operator for creating test-suite equivalent variants. go farther than prior by exploring ’s effectiveness exhaustively applying it. strategy too costly in practice be used improved software further find rates drop 12–34% 2–6% 5-edit sequences, which implies progress will need human-inspired target specific faults or improvements. A amenable extent automatically editing it likely produce passing are first systematically code measure correlates with program’s amenability modification. found no strong correlations, leaving question open.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Program Transformation for Program Verification

We present a transformational approach to program verification and software model checking that uses three main ingredients: (i) Constraint Logic Programming (CLP), (ii) metaprogramming and program specialization, and (iii) proof by transformation. (i) Constraints are used for representing in a compact way (finite or infinite) sets of values or memory states, and logic is used for expressing pr...

متن کامل

Using a Program Transformation

Domain-Specific Modeling (DSM) allows domain experts to concentrate on the essential characteristics of a problem space without being overwhelmed by the complexities that may occur in the solution space. DSM is focused on the creation of a metamodel for a specific domain, from which instances pertaining to specific configurations of that domain can be constructed. However, as the metamodel unde...

متن کامل

ADAPT: Automated De-Coupled Adaptive Program Transformation

Dynamic program optimization o ers performance improvements far beyond those possible with traditional compile-time optimization [1, 2, 3, 4]. These gains are due to the ability to exploit both architectural and input data set characteristics that are unknown prior to execution time. In this paper, we propose a novel framework for dynamic program optimization, ADAPT (Automated De-coupled Adapti...

متن کامل

Program Transformation Using HATS 1.84

This article gives an overview of a transformation system called HATS – a freely available platform independent IDE facilitating experimentation in transformation-oriented software development. Examples are discussed highlighting how the transformational abstractions provided by HATS can be used to solve various problems.

متن کامل

Program Transformation for Locality Using Affinity Regions

AAnity regions ensure that a shared processor schedule, mapping loop iterations to processors, is used in consecutive parallel loop nests. Using aanity regions can improve locality without aaecting par-allelism. Unlike loop fusion, aanity regions are always safe. Also, unlike parallel regions, aanity regions do not require explicit code for mapping loop iterations to processors. While aanity re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Empirical Software Engineering

سال: 2023

ISSN: ['1382-3256', '1573-7616']

DOI: https://doi.org/10.1007/s10664-023-10344-5